A new genetic representation for quadratic assignment problem
نویسندگان
چکیده
منابع مشابه
A greedy genetic algorithm for the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. In this paper, we suggest a genetic algorithm for the QAP and report its computational behavior. The genetic algorithm incorporates many greedy principles in its design and, hence, we refer to it as a greedy genetic algorithm. The ideas we incorporate in ...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملA Hybrid Genetic Algorithm for the Quadratic Assignment Problem
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the results obtained through the application of each of these algorithms separately. The QAP is a NP-hard problem and instances of size n > 15 are still considered intractable. The results of our experiments suggest that CHC com...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملA Multi Hybrid Genetic Algorithm for the Quadratic Assignment Problem
Quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems which can model many real life problems. Because of its theoretical and practical importance, QAP has attracted attention of many researchers. In this paper, a multi hybrid genetic algorithm for solving QAP is proposed. The key feature of our approach is the hybridization of three metaheuristics, tabu s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2011
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor1102225k